Myhill-Nerode Theorem for Recognizable Tree Series Revisited
نویسنده
چکیده
In this contribution the Myhill-Nerode congruence relation on tree series is reviewed and a more detailed analysis of its properties is presented. It is shown that, if a tree series is deterministically recognizable over a zero-divisor free and commutative semiring, then the Myhill-Nerode congruence relation has finite index. By [Borchardt: Myhill-Nerode Theorem for Recognizable Tree Series. LNCS 2710. Springer 2003] the converse holds for commutative semifields, but not in general. In the second part, a slightly adapted version of the MyhillNerode congruence relation is defined and a characterization is obtained for all-accepting weighted tree automata over multiplicatively cancellative and commutative semirings.
منابع مشابه
Recognizable Graph Languages for Checking Invariants
We generalize the order-theoretic variant of the Myhill-Nerode theorem to graph languages, and characterize the recognizable graph languages as the class of languages for which the Myhill-Nerode quasi order is a well quasi order. In the second part of the paper we restrict our attention to graphs of bounded interface size, and use Myhill-Nerode quasi orders to verify that, for such bounded grap...
متن کاملA Myhill-Nerode Theorem beyond Trees and Forests via Finite Syntactic Categories Internal to Monoids
The paper introduces recognizable languages as inverse images of sets of arrows from finite categories internal to monoids. The first result is the Myhill-Nerode Theorem as a conservative extension of the classic result for tree languages. The second result shows that a language of planar acyclic circuit diagrams whose gates have non-empty lists of input and output ports is recognizable if, and...
متن کاملA Note on Recognizable Sets of Unranked and Unordered Trees
Recognizable sets of unranked, unordered trees have been introduced in Courcelle [C89] in a Myhill-Nerode [N58] style of inverse homomorphisms of suitable finite magmas. This is equivalent of being the the union of some congruence classes of a congruence of finite index. We will add to the well-known concept of regular tree grammars a handling of nodes labeled with ǫ. With this rather unconvent...
متن کاملMyhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملSeries-Parallel Posets: Algebra, Automata and Languages
In order to model concurrency, we extend automata theory from the usual word languages (sets of labelled linear orders) to sets of labelled series-parallel posets | or, equivalently, to sets of terms in an algebra with two product operations: sequential and parallel. We rst consider languages of posets having bounded width, and characterize them using depth-nilpotent algebras. Next we introduce...
متن کامل